Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar3/nonterminSLASHCSRSLASHEx1

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

The set Q consists of the following terms:

g₁(x0)
c
h₁(d)

Q DP problem:
The TRS P consists of the following rules:

G₁(X) -> H₁(X)
H₁(d) -> G₁(c)
H₁(d) -> C

The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

The set Q consists of the following terms:

g₁(x0)
c
h₁(d)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

G₁(X) -> H₁(X)
H₁(d) -> G₁(c)
H₁(d) -> C

The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

The set Q consists of the following terms:

g₁(x0)
c
h₁(d)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 1 SCC with 1 less node.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G₁(X) -> H₁(X)
H₁(d) -> G₁(c)

The TRS R consists of the following rules:

g₁(X) -> h₁(X)
c -> d
h₁(d) -> g₁(c)

The set Q consists of the following terms:

g₁(x0)
c
h₁(d)

We have to consider all minimal (P,Q,R)-chains.